Adapting Distributed Database Systems for High Availability
نویسندگان
چکیده
The availability offered by current data replication and update algorithms varies with dynamically changing conditions which include the network configuration and system load. With dynamic adaptability, systems can switch to an appropriate mechanism to improve perFormance and availability, In this paper, we present an algorithm to estimate the overall availability of transaction processing in a distributed database system. Our algorithm estimates the system availability of different replication schemas based on transaction access patterns and the availability of system components. A flow graph is used to represent and simplify the computation and the combinatorial model. We illustrate the incorporation of our algorithm into RAID, an adaptable distributed database system, thus permitting the RAID software to dynamically decide to redistribute data or adopt a more suitable update algorithm. The proposed technique for the measurement of availability can also be used during the design phase of a system. [(cywords: Adaptability, Availability, Reliability, Distributed Database, Computer Network, Performance, Data Replication, Transaction Processing,
منابع مشابه
Applying Fault-Tolerance Principles to Security Research
We have been conducting research in reliable distributed systems in the last twenty years. We have worked on the development of concepts such as consistency, atomicity, durability, availability, rollback, check points, adaptability etc. [1,2]. IEEE symposium on Reliable Distributed systems held every year contains many of the papers dealing with high availability, dependability, and non-stop op...
متن کاملA Quorum-Based Commit and Termination Protocol for Distributed Database Systems
Correctness and availability are two competing goals in the design of a fault-tolerant transaction processing strategy for distributed database systems. To achieve absolute correctness, availability of data may be reduced when failures occur. In this paper, a quorum-based commit and termination protocol is designed with the goal of maintaining high data availability in case of failures. The pro...
متن کاملTitle A quorum-based commit and termination protocol for distributed database systems
Correctness and availability are two competing goals in the design of a fault-tolerant transaction processing strategy for distributed database systems. To achieve absolute correctness, availability of data may be reduced when failures occur. In this paper, a quorum-based commit and termination protocol is designed with the goal of maintaining high data availability in case of failures. The pro...
متن کاملThe Case for Determinism in Database Systems
Replication is a widely used method for achieving high availability in database systems. Due to the nondeterminism inherent in traditional concurrency control schemes, however, special care must be taken to ensure that replicas don’t diverge. Log shipping, eager commit protocols, and lazy synchronization protocols are well-understood methods for safely replicating databases, but each comes with...
متن کاملEfficient Transparent Application Recovery In Client-Server Information Systems
Database systems recover persistent data, providing high database availability. However, database applications, typically residing on client or “middle-tier” application-server machines, may lose work because of a server failure. This prevents the masking of server failures from the human user and substantially degrades application availability. This paper aims to enable high application availa...
متن کامل